Compression of Propositional Resolution Proofs via Partial Regularization
نویسندگان
چکیده
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, removing an inference η when it is redundant in the sense that its pivot literal already occurs as the pivot of another inference located below in the path from η to the root of the proof. The second algorithm, LowerUnits, delays the resolution of (both input and derived) unit clauses, thus removing (some) inferences having the same pivot but possibly occurring also in different branches of the proof.
منابع مشابه
Compression of Propositional Resolution Proofs by Lowering Subproofs
This paper describes a generalization of the LowerUnits algorithm [10] for the compression of propositional resolution proofs. The generalized algorithm, called LowerUnivalents, is able to lower not only units but also subproofs of non-unit clauses, provided that they satisfy some additional conditions. This new algorithm is particularly suited to be combined with the RecyclePivotsWithIntersect...
متن کاملTowards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses
The recently developed LowerUnits algorithm compresses propositional resolution proofs generated by SATand SMT-solvers by postponing and lowering resolution inferences involving unit clauses, which have exactly one literal. This paper describes a generalization of this algorithm to the case of first-order resolution proofs generated by automated theorem provers. An empirical evaluation of a sim...
متن کاملClausal Proof Compression Heule and Biere
Although clausal propositional proofs are significantly smaller compared to resolution proofs, their size on disk is still too large for several applications. In this paper we present several methods to compress clausal proofs. These methods are based on a two phase approach. The first phase consists of a light-weight compression algorithm that can easily be added to satisfiability solvers that...
متن کاملEPiC Series in Computing
Although clausal propositional proofs are significantly smaller compared to resolution proofs, their size on disk is still too large for several applications. In this paper we present several methods to compress clausal proofs. These methods are based on a two phase approach. The first phase consists of a light-weight compression algorithm that can easily be added to satisfiability solvers that...
متن کاملProof Transformation via Interpretation Functions1
Redesign of a class structure requires transformation of the corresponding specification. In a previous paper we have shown how to use, what we call, interpretation functions for transformation of constraints. In this paper we study the way proof are transformed via such functions. We provide a sufficient condition for interpretation functions to preserve proofs using propositional logic with m...
متن کامل